Chromatic Search Trees Revisited Institut F Ur Informatik | Report 91
نویسنده
چکیده
Relaxed balancing of search trees was introduced with the aim of speeding up the updates and allowing a high degree of concurrency. In a relaxed version of a search tree the rebalancing operations are uncoupled from the updates and may be delayed. Using local transformations the rebalancing can be performed concurrently with updates and search operations. In this paper we revisit the rebalancing of chromatic trees, a relaxed version of red-black trees. During the rebalancing of a chromatic tree it can occur that the rebalancing operations change the search structure of the tree in order to settle rebalancing requests from the history although the tree is already a balanced red-black tree. We propose how to perform the rebalancing task in such a way that each performed structural change indeed correspond to a real imbalance situation in the tree. The number of rebalancing operations needed to restore the red-black tree balance condition is still O(i+d) pointer changes and O((i+d) log(n+ i)) colour changes, if i insertions and d deletions are applied to a chromatic tree of size n that initially ful lls the balance condition of red-black trees.
منابع مشابه
Charakterisierung der Farbeigenschaften melanozytärer Hautveränderungen zur Unterstützung der Früherkennung des malignen Melanoms
Max-Planck-Institut f ur extraterrestrische Physik, Garching Department of Electrical Engineering, University of Sydney Institut f ur medizinische Statistik und Epidemiologie, TU M unchen Klinik und Poliklinik f ur Dermatologie der Universit at Regensburg Fachbereich Informatik/Mathematik, Fachhochschule M unchen Lehrstuhl f ur Theoretische Informatik und Grundlagen der KI, TU M unchen ...
متن کاملBeyond Asymmetric Choice: A note on some extensions
1 Eindhoven University of Technology, Department of Mathematics and Computing Science P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands, email: [email protected] 2 Humboldt-Universitat zu Berlin, Institut f ur Informatik Unter den Linden 6, D-10099 Berlin, Germany, email: [email protected] 3 Universitat Karlsruhe, Institut f ur Angewandte Informatik & Formale Beschreibungsve...
متن کاملInstitut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen Problem Solving with Model-generation Approaches Based on Puhr Tableaux in Proc. Problem-solving Methodologies with Automated Deduction, Workshop at Cade '98
متن کامل
Substituting Udp for Tcp: Experiences and Results Institut F Ur Theoretische Informatik Substituting Udp for Tcp: Experiences and Results
متن کامل
The locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کامل